Convergence Analysis of the Gauss-Seidel Preconditioner for Discretized One Dimensional Euler Equations

نویسنده

  • Arnold Reusken
چکیده

We consider the nonlinear system of equations that results from the Van Leer flux vector-splitting discretization of the one dimensional Euler equations. This nonlinear system is linearized at the discrete solution. The main topic of this paper is a convergence analysis of blockGauss–Seidel methods applied to this linear system of equations. Both the lexicographic and the symmetric block-Gauss–Seidel method are considered. We derive results which quantify the quality of these methods as preconditioners. These results show, for example, that for the subsonic case the symmetric Gauss–Seidel method can be expected to be a much better preconditioner than the lexicographic variant. Sharp bounds for the condition number of the preconditioned matrix are derived. AMS subject classifications. 65F10, 65N22, 65N06

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preconditioners for Linearized Discrete Compressible Euler Equations

We consider a Newton-Krylov approach for discretized compressible Euler equations. A good preconditioner in the Krylov subspace method is essential for obtaining an efficient solver in such an approach. In this paper we compare point-block-Gauss-Seidel, point-block-ILU and point-block-SPAI preconditioners. It turns out that the SPAI method is not satisfactory for our problem class. The point-bl...

متن کامل

Analysis of preconditioning and multigrid for Euler flows with low-subsonic regions

For subsonic flows and upwind-discretized, linearized 1-D Euler equations, the smoothing behavior of multigrid-accelerated point Gauss-Seidel relaxation is analyzed. Error decay by convection across domain boundaries is also discussed. A fix to poor convergence rates at low Mach numbers is sought in replacing the point relaxation applied to unconditioned Euler equations, by locally implicit "ti...

متن کامل

Numbering Techniques for Preconditioners in Iterative Solvers for Compressible Flows

We consider Newton-Krylov methods for solving discretized compressible Euler equations. A good preconditioner in the Krylov subspace method is crucial for the efficiency of the solver. In this paper we consider a point-block Gauss-Seidel method as preconditioner. We describe and compare renumbering strategies that aim at improving the quality of this preconditioner. A variant of reordering meth...

متن کامل

Preconditioning of fully implicit Runge-Kutta schemes for parabolic PDEs

Recently, the authors introduced a preconditioner for the linear systems that arise from fully implicit Runge-Kutta time stepping schemes applied to parabolic PDEs [9]. The preconditioner was a block Jacobi preconditioner, where each of the blocks were based on standard preconditioners for low-order time discretizations like implicit Euler or Crank-Nicolson. It was proven that the preconditione...

متن کامل

Block Stationary Methods for Nonsymmetric Cyclically Reduced Systems Arising from Three-Dimensional Elliptic Equations

We consider a three-dimensional convection-diffusion model problem and examine systems of equations arising from performing one step of cyclic reduction on an equally spaced mesh, discretized using the seven-point operator. We present two ordering strategies and analyze block splittings of the resulting matrices. If the matrices are consistently ordered relative to a given partitioning, Young’s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Numerical Analysis

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2003